Diversely Regularized Matrix Factorization for Accurate and Aggregately Diversified Recommendation
نویسندگان
چکیده
When recommending personalized top-k items to users, how can we recommend them diversely while satisfying users’ needs? Aggregately diversified recommender systems aim a variety of across whole users without sacrificing the recommendation accuracy. They increase exposure opportunities various items, which in turn potential revenue sellers as well user satisfaction. However, it is challenging tackle aggregate-level diversity with matrix factorization (MF), one most common models, since skewed real-world data lead results MF. In this work, propose DivMF (Diversely Regularized Matrix Factorization), novel method for aggregately recommendation. exploits coverage regularizer and skewness consider an MF model diversify results. We also carefully designed training algorithm effective training. Extensive experiments on datasets show that gives state-of-the-art performance, improving up 34.7% similar level accuracy, 27.6% accuracy compared best competitors.
منابع مشابه
User Graph Regularized Pairwise Matrix Factorization for Item Recommendation
Item recommendation from implicit, positive only feedback is an emerging setup in collaborative filtering in which only one class examples are observed. In this paper, we propose a novel method, called User Graph regularized Pairwise Matrix Factorization (UGPMF), to seamlessly integrate user information into pairwise matrix factorization procedure. Due to the use of the available information on...
متن کاملRelation Regularized Matrix Factorization
In many applications, the data, such as web pages and research papers, contain relation (link) structure among entities in addition to textual content information. Matrix factorization (MF) methods, such as latent semantic indexing (LSI), have been successfully used to map either content information or relation information into a lower-dimensional latent space for subsequent processing. However...
متن کاملTemporal Regularized Matrix Factorization
Matrix factorization approaches have been applied to a variety of applications, from recommendation systems to multi-label learning. Standard low rank matrix factorization methods fail in cases when the data can be modeled as a time series, since they do not take into account the dependencies among factors, while EM algorithms designed for time series data are inapplicable to large multiple tim...
متن کاملMatrix Factorization+ for Movie Recommendation
We present a novel model for movie recommendations using additional visual features extracted from pictural data like posters and still frames, to better understand movies. In particular, several context-based methods for recommendation are shown to be special cases of our proposed framework. Unlike existing context-based approaches, our method can be used to incorporate visual features – featu...
متن کاملCo-Regularized Collective Matrix Factorization for Joint Matrix Completion
Collective matrix factorization (CMF) is a popular technique for joint matrix completion. However, it relies on a strong assumption that matrices share a common low-rank structure, which may not be easily satisfied in practice. To lift this limitation, this paper introduces a novel joint matrix completion method based on a relaxed assumption. Specifically, we allow the matrix structures to be d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-33380-4_28